Search results for "design [accelerator]"
showing 10 items of 594 documents
Generation of Design Principles as Knowledge Conversion - Elucidating Dynamics
2021
In this paper we apply the perspective of knowledge conversion with recent identified core elements for developing design principles to elucidate the dynamics of design principles. In the paper, the elements of influence, actors, and formulation are integrated in a knowledge conversion process of socialization, externalization, combination, and internalization – through which tacit knowledge is made explicit, shared, and turned into action. We exemplify this process with three empirical cases using action design research (ADR) to develop IT artifacts and generate design principles. Our paper shows the dynamics across a process of generating design principles. Viewing the generation of desig…
Active emulation of computer codes with Gaussian processes – Application to remote sensing
2020
Many fields of science and engineering rely on running simulations with complex and computationally expensive models to understand the involved processes in the system of interest. Nevertheless, the high cost involved hamper reliable and exhaustive simulations. Very often such codes incorporate heuristics that ironically make them less tractable and transparent. This paper introduces an active learning methodology for adaptively constructing surrogate models, i.e. emulators, of such costly computer codes in a multi-output setting. The proposed technique is sequential and adaptive, and is based on the optimization of a suitable acquisition function. It aims to achieve accurate approximations…
Algorithms for Computing Abelian Periods of Words
2012
Constantinescu and Ilie (Bulletin EATCS 89, 167--170, 2006) introduced the notion of an \emph{Abelian period} of a word. A word of length $n$ over an alphabet of size $\sigma$ can have $\Theta(n^{2})$ distinct Abelian periods. The Brute-Force algorithm computes all the Abelian periods of a word in time $O(n^2 \times \sigma)$ using $O(n \times \sigma)$ space. We present an off-line algorithm based on a $\sel$ function having the same worst-case theoretical complexity as the Brute-Force one, but outperforming it in practice. We then present on-line algorithms that also enable to compute all the Abelian periods of all the prefixes of $w$.
A note on easy and efficient computation of full abelian periods of a word
2016
Constantinescu and Ilie (Bulletin of the EATCS 89, 167-170, 2006) introduced the idea of an Abelian period with head and tail of a finite word. An Abelian period is called full if both the head and the tail are empty. We present a simple and easy-to-implement $O(n\log\log n)$-time algorithm for computing all the full Abelian periods of a word of length $n$ over a constant-size alphabet. Experiments show that our algorithm significantly outperforms the $O(n)$ algorithm proposed by Kociumaka et al. (Proc. of STACS, 245-256, 2013) for the same problem.
Online shortest paths with confidence intervals for routing in a time varying random network
2018
International audience; The increase in the world's population and rising standards of living is leading to an ever-increasing number of vehicles on the roads, and with it ever-increasing difficulties in traffic management. This traffic management in transport networks can be clearly optimized by using information and communication technologies referred as Intelligent Transport Systems (ITS). This management problem is usually reformulated as finding the shortest path in a time varying random graph. In this article, an online shortest path computation using stochastic gradient descent is proposed. This routing algorithm for ITS traffic management is based on the online Frank-Wolfe approach.…
ECCOLA : a Method for Implementing Ethically Aligned AI Systems
2020
Various recent Artificial Intelligence (AI) system failures, some of which have made the global headlines, have highlighted issues in these systems. These failures have resulted in calls for more ethical AI systems that better take into account their effects on various stakeholders. However, implementing AI ethics into practice is still an on-going challenge. High-level guidelines for doing so exist, devised by governments and private organizations alike, but lack practicality for developers. To address this issue, in this paper, we present a method for implementing AI ethics. The method, ECCOLA, has been iteratively developed using a cyclical action design research approach. The method aim…
Continuous design control for machine learning in certified medical systems
2022
AbstractContinuous software engineering has become commonplace in numerous fields. However, in regulating intensive sectors, where additional concerns need to be taken into account, it is often considered difficult to apply continuous development approaches, such as devops. In this paper, we present an approach for using pull requests as design controls, and apply this approach to machine learning in certified medical systems leveraging model cards, a novel technique developed to add explainability to machine learning systems, as a regulatory audit trail. The approach is demonstrated with an industrial system that we have used previously to show how medical systems can be developed in a con…
Routing quantum information in spin chains
2013
Two different models for performing efficiently routing of a quantum state are presented. Both cases involve an XX spin chain working as data bus and additional spins that play the role of sender and receivers, one of which is selected to be the target of the quantum state transmission protocol via a coherent quantum coupling mechanism making use of local/global magnetic fields. Quantum routing is achieved, in the first of the models considered, by weakly coupling the sender and the receiver to the data bus. In the second model, strong magnetic fields acting on additional spins located between the sender/receiver and the data bus allow us to perform high fidelity routing.
The General Routing Problem polyhedron: Facets from the RPP and GTSP polyhedra
1998
[EN] In this paper we study the polyhedron associated with the General Routing Problem (GRP). This problem, first introduced by Orloff in 1974, is a generalization of both the Rural Postman Problem (RPP) and the Graphical Traveling Salesman Problem (GTSP) and, thus, is NP -hard. We describe a formulation of the problem such that from every non-trivial facet-inducing inequality for the RPP and GTSP polyhedra, we obtain facet-inducing inequalities for the GRP polyhedron, We describe a new family of facet-inducing inequalities for the GRP, the honeycomb constraints, which seem to be very useful for solving GRP and RPP instances. Finally, new classes of facets obtained by composition of facet-i…
Identificación de factores influyentes en el proceso de aprendizaje en estudios de máster
2019
[ES] La puesta en marcha de los postgrados ha supuesto, en muchos casos, la incorporación de metodologías más apropiadas a este nivel educativo. En el trabajo que se presenta se estudia la repercusión de una metodología, que combina el modelo tradicional y el design thinking, en el rendimiento académico de los estudiantes de un máster ofertado por la Universitat de València y enmarcado dentro de la rama de ciencias sociales y jurídicas. El estudio hace énfasis en si el resultado obtenido aplicando dicha metodología muestra diferencias atendiendo a factores del alumnado de tipo académico y personal (estudios universitarios previos, situación laboral, ...). Si dichas disparidades se confirmar…